0.01/0.06 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.01/0.09 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.08/0.27 % Computer : n016.cluster.edu 0.08/0.27 % Model : x86_64 x86_64 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.27 % Memory : 8042.1875MB 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.27 % CPULimit : 1200 0.08/0.27 % WCLimit : 120 0.08/0.27 % DateTime : Tue Jul 13 14:36:08 EDT 2021 0.08/0.27 % CPUTime : 0.08/0.27 % Number of cores: 8 0.08/0.27 % Python version: Python 3.6.8 0.08/0.28 # Version: 2.6rc1-ho 0.12/0.30 # No SInE strategy applied 0.12/0.30 # Trying AutoSched0 for 59 seconds 0.42/0.64 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y 0.42/0.64 # and selection function SelectMaxLComplexAvoidPosPred. 0.42/0.64 # 0.42/0.64 # Preprocessing time : 0.084 s 0.42/0.64 # Presaturation interreduction done 0.42/0.64 0.42/0.64 # Proof found! 0.42/0.64 # SZS status Theorem 0.42/0.64 # SZS output start CNFRefutation 0.42/0.64 thf(fact_4_get__M__shadow__root__put__M__document__different__pointers, axiom, ![X12:shadow_root_ptr_d, X8:docume1935157360tr_d_e, X3:heap_S1465075775_j_k_l, X139:(m > m) > rObjec1617416918on_j_k > rObjec1617416918on_j_k, X140:m, X6:heap_S1465075775_j_k_l, X141:rObjec2068690451tion_j > n]:((cast_s253715760_r_d_e @ X12)!=(X8)=>(heap_E494191872t_unit @ X3 @ (put_M_674497586_h_i_l @ X8 @ X139 @ X140) @ X6=>heap_E1683112693tion_n @ (shadow569799008_i_k_l @ X12 @ X141) @ X3 @ X6)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_4_get__M__shadow__root__put__M__document__different__pointers)). 0.42/0.64 thf(conj_4, conjecture, heap_E1683112693tion_n @ (shadow569799008_i_k_l @ shadow_root_ptr @ getter) @ h @ h2, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_4)). 0.42/0.64 thf(conj_0, hypothesis, heap_E494191872t_unit @ h @ (put_M_674497586_h_i_l @ document_ptr @ setter @ v) @ h2, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.42/0.64 thf(conj_3, hypothesis, (cast_s253715760_r_d_e @ shadow_root_ptr)!=(document_ptr), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_3)). 0.42/0.64 thf(c_0_4, plain, ![X2707:shadow_root_ptr_d, X2708:docume1935157360tr_d_e, X2709:heap_S1465075775_j_k_l, X2710:(m > m) > rObjec1617416918on_j_k > rObjec1617416918on_j_k, X2711:m, X2712:heap_S1465075775_j_k_l, X2713:rObjec2068690451tion_j > n]:((cast_s253715760_r_d_e @ X2707)=(X2708)|(~heap_E494191872t_unit @ X2709 @ (put_M_674497586_h_i_l @ X2708 @ X2710 @ X2711) @ X2712|heap_E1683112693tion_n @ (shadow569799008_i_k_l @ X2707 @ X2713) @ X2709 @ X2712)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_4_get__M__shadow__root__put__M__document__different__pointers])])). 0.42/0.64 thf(c_0_5, negated_conjecture, ~heap_E1683112693tion_n @ (shadow569799008_i_k_l @ shadow_root_ptr @ getter) @ h @ h2, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_4])])). 0.42/0.64 thf(c_0_6, plain, ![X3:heap_S1465075775_j_k_l, X8:docume1935157360tr_d_e, X13:rObjec2068690451tion_j > n, X12:shadow_root_ptr_d, X42:m, X41:(m > m) > rObjec1617416918on_j_k > rObjec1617416918on_j_k, X6:heap_S1465075775_j_k_l]:((cast_s253715760_r_d_e @ X12)=(X8)|heap_E1683112693tion_n @ (shadow569799008_i_k_l @ X12 @ X13) @ X3 @ X6|~heap_E494191872t_unit @ X3 @ (put_M_674497586_h_i_l @ X8 @ X41 @ X42) @ X6), inference(split_conjunct,[status(thm)],[c_0_4])). 0.42/0.64 thf(c_0_7, hypothesis, heap_E494191872t_unit @ h @ (put_M_674497586_h_i_l @ document_ptr @ setter @ v) @ h2, inference(split_conjunct,[status(thm)],[conj_0])). 0.42/0.64 thf(c_0_8, negated_conjecture, ~heap_E1683112693tion_n @ (shadow569799008_i_k_l @ shadow_root_ptr @ getter) @ h @ h2, inference(split_conjunct,[status(thm)],[c_0_5])). 0.42/0.64 thf(c_0_9, hypothesis, ![X12:shadow_root_ptr_d, X13:rObjec2068690451tion_j > n]:((cast_s253715760_r_d_e @ X12)=(document_ptr)|heap_E1683112693tion_n @ (shadow569799008_i_k_l @ X12 @ X13) @ h @ h2), inference(spm,[status(thm)],[c_0_6, c_0_7])). 0.42/0.64 thf(c_0_10, hypothesis, (cast_s253715760_r_d_e @ shadow_root_ptr)!=(document_ptr), inference(split_conjunct,[status(thm)],[conj_3])). 0.42/0.64 thf(c_0_11, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10]), ['proof']). 0.42/0.64 # SZS output end CNFRefutation 0.42/0.64 # Proof object total steps : 12 0.42/0.64 # Proof object clause steps : 6 0.42/0.64 # Proof object formula steps : 6 0.42/0.64 # Proof object conjectures : 4 0.42/0.64 # Proof object clause conjectures : 2 0.42/0.64 # Proof object formula conjectures : 2 0.42/0.64 # Proof object initial clauses used : 4 0.42/0.64 # Proof object initial formulas used : 4 0.42/0.64 # Proof object generating inferences : 2 0.42/0.64 # Proof object simplifying inferences : 1 0.42/0.64 # Training examples: 0 positive, 0 negative 0.42/0.64 # Parsed axioms : 570 0.42/0.64 # Removed by relevancy pruning/SinE : 0 0.42/0.64 # Initial clauses : 730 0.42/0.64 # Removed in clause preprocessing : 255 0.42/0.64 # Initial clauses in saturation : 475 0.42/0.64 # Processed clauses : 3498 0.42/0.64 # ...of these trivial : 47 0.42/0.64 # ...subsumed : 1700 0.42/0.64 # ...remaining for further processing : 1751 0.42/0.64 # Other redundant clauses eliminated : 255 0.42/0.64 # Clauses deleted for lack of memory : 0 0.42/0.64 # Backward-subsumed : 48 0.42/0.64 # Backward-rewritten : 12 0.42/0.64 # Generated clauses : 15431 0.42/0.64 # ...of the previous two non-trivial : 9167 0.42/0.64 # Contextual simplify-reflections : 104 0.42/0.64 # Paramodulations : 8195 0.42/0.64 # Factorizations : 12 0.42/0.64 # NegExts : 88 0.42/0.64 # Equation resolutions : 277 0.42/0.64 # Propositional unsat checks : 0 0.42/0.64 # Propositional check models : 0 0.42/0.64 # Propositional check unsatisfiable : 0 0.42/0.64 # Propositional clauses : 0 0.42/0.64 # Propositional clauses after purity: 0 0.42/0.64 # Propositional unsat core size : 0 0.42/0.64 # Propositional preprocessing time : 0.000 0.42/0.64 # Propositional encoding time : 0.000 0.42/0.64 # Propositional solver time : 0.000 0.42/0.64 # Success case prop preproc time : 0.000 0.42/0.64 # Success case prop encoding time : 0.000 0.42/0.64 # Success case prop solver time : 0.000 0.42/0.64 # Current number of processed clauses : 1154 0.42/0.64 # Positive orientable unit clauses : 107 0.42/0.64 # Positive unorientable unit clauses: 0 0.42/0.64 # Negative unit clauses : 15 0.42/0.64 # Non-unit-clauses : 1032 0.42/0.64 # Current number of unprocessed clauses: 6545 0.42/0.64 # ...number of literals in the above : 30627 0.42/0.64 # Current number of archived formulas : 0 0.42/0.64 # Current number of archived clauses : 551 0.42/0.64 # Clause-clause subsumption calls (NU) : 337759 0.42/0.64 # Rec. Clause-clause subsumption calls : 133298 0.42/0.64 # Non-unit clause-clause subsumptions : 1775 0.42/0.64 # Unit Clause-clause subsumption calls : 4249 0.42/0.64 # Rewrite failures with RHS unbound : 0 0.42/0.64 # BW rewrite match attempts : 103 0.42/0.64 # BW rewrite match successes : 7 0.42/0.65 # Condensation attempts : 0 0.42/0.65 # Condensation successes : 0 0.42/0.65 # Termbank termtop insertions : 226577 0.42/0.65 0.42/0.65 # ------------------------------------------------- 0.42/0.65 # User time : 0.324 s 0.42/0.65 # System time : 0.022 s 0.42/0.65 # Total time : 0.346 s 0.42/0.65 # Maximum resident set size: 3128 pages 0.42/0.65 EOF